[This topic is pre-release documentation and is subject to change in future releases. Blank topics are included as placeholders.]
Computes the set-theoretic union of two collections. The union of two sets
is all items that appear in either of the sets. If an item appears X times in one set,
and Y times in the other set, the union contains the item Maximum(X,Y) times.
The source collections are not changed.
A new collection is created with the union of the collections; the order of the
items in this collection is undefined.
Namespace: Wintellect.PowerCollections
Assembly:
PowerCollections (in PowerCollections.dll)
Syntax
| C# |
|---|
public static IEnumerable<T> SetUnion<T>( IEnumerable<T> collection1, IEnumerable<T> collection2 ) |
| Visual Basic (Declaration) |
|---|
Public Shared Function SetUnion(Of T) ( _ collection1 As IEnumerable(Of T), _ collection2 As IEnumerable(Of T) _ ) As IEnumerable(Of T) |
| Visual C++ |
|---|
public: generic<typename T> static IEnumerable<T>^ SetUnion ( IEnumerable<T>^ collection1, IEnumerable<T>^ collection2 ) |
Parameters
- collection1
- IEnumerable<(Of <T>)>
The first collection to union.
- collection2
- IEnumerable<(Of <T>)>
The second collection to union.
Return Value
The union of the two collections, considered as sets.Type Parameters
- T
Remarks
When equal items appear in both collections, the returned collection will include an arbitrary choice of one of the two equal items.
The default sense of equality for T is used, as defined by T's implementation of IComparable<T>.Equals or object.Equals.
If both collections are Set, Bag, OrderedSet, or OrderedBag collections, it is more efficient to use the Union or UnionWith methods on that class.
Exceptions
| Exception | Condition |
|---|---|
| System..::ArgumentNullException | collection1 or collection2 is null. |
See Also
Algorithms Class
Wintellect.PowerCollections Namespace
Send comments about this topic to Microsoft.